Solving Imperfect Recall Games (Doctoral Consortium)
نویسنده
چکیده
Imperfect recall games remain an unexplored part of the game theory, even though recent results in abstraction algorithms show that the imperfect recall might be the key to solving the immense games found in the real world efficiently. Our research objective is to develop the first algorithm capable of outperforming the state-of-the-art solvers applied directly to perfect recall games, by creating and solving its imperfect recall abstraction. To achieve this, we need to answer a set of open questions considering the imperfect recall games. Namely (1) what properties allow the existence of Nash equilibrium in behavioral strategies in imperfect recall games and (2) what information are the players allowed to forget to guarantee that the resulting imperfect recall game can be used to solve the original game with a bounded error.
منابع مشابه
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games
Extensive-form games with imperfect recall are an important model of dynamic games where the players are allowed to forget previously known information. Often, imperfect recall games are the result of an abstraction algorithm that simplifies a large game with perfect recall. Unfortunately, solving an imperfect recall game has fundamental problems since a Nash equilibrium does not have to exist....
متن کاملAn Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games
We solve large two-player zero-sum extensive-form games with perfect recall. We propose a new algorithm based on fictitious play that significantly reduces memory requirements for storing average strategies. The key feature is exploiting imperfect recall abstractions while preserving the convergence rate and guarantees of fictitious play applied directly to the perfect recall game. The algorith...
متن کاملPerfect Recall and Pruning in Games withImperfect
Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker), as well as many economic and political models. Here, we investigate algorithms for solving imperfect information games expressed in their extensive (game-tree) form. In particular, we consider algorithms for the simplest form of solution | a pure-strategy equi...
متن کاملSolution Concepts in A-Loss Recall Games: Existence and Computational Complexity
Imperfect recall games represent dynamic interactions where players forget previously known information, such as history of played actions. The importance of imperfect recall games stems from allowing a concise representation of strategies compared to perfect recall games where players remember all information. However, most of the algorith-mic results are negative for imperfect recall games – ...
متن کاملSolving Counter Parity Games
We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic systems from the literature. We present an elementary algorithm for computing the exact value of a counter parity game, which both generalizes previous results and improves their complexity. To this end, we introduce a clas...
متن کامل